Complexity : The Ramsey Theory
نویسنده
چکیده
1 Recall We state what was proven in Multiparty Communication Complexity I. has all of the inputs except x i. Let d(f) be the total number of bits broadcast in the optimal deterministic protocol for f. At the end of the protocol all parties must know the answer. This is called the multiparty communication complexity of f. The scenario is called the forehead model.
منابع مشابه
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size (k 2 ) . Let rk be the minimal n for which the statement holds. We prove that RAM(rk, k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák’s work in bounded arithmetic [19] it is known that ther...
متن کاملOn Ramsey-type theorems
In [21], Frank Plumpton Ramsey proved what has turned out to be a remarkable and important theorem which is now known as Ramsey's theorem. This result is a generalization of the pigeonhole principle and can now be seen as part of a family of theorems of the same flavour. These Ramsey-type theorems all have the common feature that they assert, in some precise combinatorial way, that if we deal w...
متن کاملThe Canonical Ramsey Theorem and Computability Theory
Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succe...
متن کاملOn a generalization of Ramsey theory
Classical Multi-color Ramsey Theory pertains to the existence of monochromatic subsets of structured multicolored sets such that the subsets have a given property or structure. This paper examines a generalization of Ramsey theory that allows the subsets to have specified groupings of colors. By allowing more than one color in subsets, the corresponding minimal sets for finite cases tend to be ...
متن کاملThe Complexity of Proving That a Graph Is Ramsey
We say that a graph with n vertices is c-Ramsey if it does not contain either a clique or an independent set of size c logn. We define a CNF formula which expresses this property for a graph G. We show a superpolynomial lower bound on the length of resolution proofs that G is c-Ramsey, for every graph G. Our proof makes use of the fact that every c-Ramsey graph must contain a large subgraph wit...
متن کاملOn the Computational Complexity and Strategies of Online Ramsey Theory
An online Ramsey game (G, H) is a game between Builder and Painter, alternating in turns. In each round Builder draws an edge and Painter colors it either red or blue. Builder wins if after some round there is a monochromatic copy of the graph H, otherwise Painter is the winner. The rule for Builder is that after each his move the resulting graph must belong to the class of graphs G. In this ab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008